0.11/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.11	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.11/0.32	% Computer : n013.cluster.edu
0.11/0.32	% Model    : x86_64 x86_64
0.11/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory   : 8042.1875MB
0.11/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 1920
0.11/0.32	% WCLimit    : 240
0.11/0.32	% DateTime   : Wed Jul 30 02:20:19 EDT 2025
0.11/0.32	% CPUTime    : 
0.19/0.46	Running higher-order theorem proving
0.19/0.50	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.hj12GZSrhe/E---3.1_20691.p
0.70/0.62	# Version: 3.0.0-ho
0.70/0.62	# Preprocessing class: HSLSSMSMSSSNHSA.
0.70/0.62	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.70/0.62	# Starting new_ho_10 with 1200s (5) cores
0.70/0.62	# Starting new_ho_10_cnf2 with 240s (1) cores
0.70/0.62	# Starting lpo9_lambda_fix with 240s (1) cores
0.70/0.62	# Starting new_bool_1 with 240s (1) cores
0.70/0.62	# lpo9_lambda_fix with pid 20771 completed with status 0
0.70/0.62	# Result found by lpo9_lambda_fix
0.70/0.62	# Preprocessing class: HSLSSMSMSSSNHSA.
0.70/0.62	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.70/0.62	# Starting new_ho_10 with 1200s (5) cores
0.70/0.62	# Starting new_ho_10_cnf2 with 240s (1) cores
0.70/0.62	# Starting lpo9_lambda_fix with 240s (1) cores
0.70/0.62	# SinE strategy is gf500_gu_R04_F100_L20000
0.70/0.62	# Search class: HGHSM-FSLM32-MHSFFSBN
0.70/0.62	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.70/0.62	# Starting new_ho_10 with 130s (1) cores
0.70/0.62	# new_ho_10 with pid 20774 completed with status 0
0.70/0.62	# Result found by new_ho_10
0.70/0.62	# Preprocessing class: HSLSSMSMSSSNHSA.
0.70/0.62	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.70/0.62	# Starting new_ho_10 with 1200s (5) cores
0.70/0.62	# Starting new_ho_10_cnf2 with 240s (1) cores
0.70/0.62	# Starting lpo9_lambda_fix with 240s (1) cores
0.70/0.62	# SinE strategy is gf500_gu_R04_F100_L20000
0.70/0.62	# Search class: HGHSM-FSLM32-MHSFFSBN
0.70/0.62	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.70/0.62	# Starting new_ho_10 with 130s (1) cores
0.70/0.62	# Preprocessing time       : 0.008 s
0.70/0.62	# Presaturation interreduction done
0.70/0.62	
0.70/0.62	# Proof found!
0.70/0.62	# SZS status Theorem
0.70/0.62	# SZS output start CNFRefutation
0.70/0.62	thf(decl_sort1, type, real: $tType).
0.70/0.62	thf(decl_sort2, type, cars: $tType).
0.70/0.62	thf(decl_sort3, type, traffic: $tType).
0.70/0.62	thf(decl_sort4, type, view_e774982825t_unit: $tType).
0.70/0.62	thf(decl_sort5, type, real_int: $tType).
0.70/0.62	thf(decl_25, type, zero_zero_real: real).
0.70/0.62	thf(decl_26, type, len: (cars > traffic > cars > real) > view_e774982825t_unit > traffic > cars > real_int).
0.70/0.62	thf(decl_29, type, ord_less_real: real > real > $o).
0.70/0.62	thf(decl_39, type, left: real_int > real).
0.70/0.62	thf(decl_41, type, real_length: real_int > real).
0.70/0.62	thf(decl_43, type, right: real_int > real).
0.70/0.62	thf(decl_44, type, regular_regular: cars > traffic > cars > real).
0.70/0.62	thf(decl_46, type, space: (cars > traffic > cars > real) > traffic > view_e774982825t_unit > cars > real_int).
0.70/0.62	thf(decl_49, type, pos: traffic > cars > real).
0.70/0.62	thf(decl_50, type, ext_Product_unit: view_e774982825t_unit > real_int).
0.70/0.62	thf(decl_53, type, c: cars).
0.70/0.62	thf(decl_55, type, d: cars).
0.70/0.62	thf(decl_61, type, ts: traffic).
0.70/0.62	thf(decl_63, type, v: view_e774982825t_unit).
0.70/0.62	thf(conj_0, conjecture, ((ord_less_real @ (left @ (ext_Product_unit @ v)) @ (right @ (space @ regular_regular @ ts @ v @ d)))&(ord_less_real @ (left @ (space @ regular_regular @ ts @ v @ d)) @ (right @ (ext_Product_unit @ v)))), file('/export/starexec/sandbox/tmp/tmp.hj12GZSrhe/E---3.1_20691.p', conj_0)).
0.70/0.62	thf(fact_10_hmlsl_Oleft__space, axiom, ![X2:traffic, X1:view_e774982825t_unit, X3:cars]:(((left @ (space @ regular_regular @ X2 @ X1 @ X3))=(pos @ X2 @ X3))), file('/export/starexec/sandbox/tmp/tmp.hj12GZSrhe/E---3.1_20691.p', fact_10_hmlsl_Oleft__space)).
0.70/0.62	thf(fact_3_hmlsl_Olen__non__empty__inside, axiom, ![X1:view_e774982825t_unit, X2:traffic, X3:cars]:((((ord_less_real @ (left @ (ext_Product_unit @ X1)) @ (right @ (space @ regular_regular @ X2 @ X1 @ X3)))&(ord_less_real @ (left @ (space @ regular_regular @ X2 @ X1 @ X3)) @ (right @ (ext_Product_unit @ X1))))<=(ord_less_real @ zero_zero_real @ (real_length @ (len @ regular_regular @ X1 @ X2 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.hj12GZSrhe/E---3.1_20691.p', fact_3_hmlsl_Olen__non__empty__inside)).
0.70/0.62	thf(fact_4_v_H__d, axiom, (ord_less_real @ zero_zero_real @ (real_length @ (len @ regular_regular @ v @ ts @ d))), file('/export/starexec/sandbox/tmp/tmp.hj12GZSrhe/E---3.1_20691.p', fact_4_v_H__d)).
0.70/0.62	thf(fact_11_len__eq, axiom, ((len @ regular_regular @ v @ ts @ c)=(len @ regular_regular @ v @ ts @ d)), file('/export/starexec/sandbox/tmp/tmp.hj12GZSrhe/E---3.1_20691.p', fact_11_len__eq)).
0.70/0.62	thf(c_0_5, negated_conjecture, ~(((ord_less_real @ (left @ (ext_Product_unit @ v)) @ (right @ (space @ regular_regular @ ts @ v @ d)))&(ord_less_real @ (left @ (space @ regular_regular @ ts @ v @ d)) @ (right @ (ext_Product_unit @ v))))), inference(assume_negation,[status(cth)],[conj_0])).
0.70/0.62	thf(c_0_6, negated_conjecture, (~(ord_less_real @ (left @ (ext_Product_unit @ v)) @ (right @ (space @ regular_regular @ ts @ v @ d)))|~(ord_less_real @ (left @ (space @ regular_regular @ ts @ v @ d)) @ (right @ (ext_Product_unit @ v)))), inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])).
0.70/0.62	thf(c_0_7, plain, ![X1266:traffic, X1267:view_e774982825t_unit, X1268:cars]:(((left @ (space @ regular_regular @ X1266 @ X1267 @ X1268))=(pos @ X1266 @ X1268))), inference(variable_rename,[status(thm)],[fact_10_hmlsl_Oleft__space])).
0.70/0.62	thf(c_0_8, plain, ![X1:view_e774982825t_unit, X2:traffic, X3:cars]:(((ord_less_real @ zero_zero_real @ (real_length @ (len @ regular_regular @ X1 @ X2 @ X3)))=>((ord_less_real @ (left @ (ext_Product_unit @ X1)) @ (right @ (space @ regular_regular @ X2 @ X1 @ X3)))&(ord_less_real @ (left @ (space @ regular_regular @ X2 @ X1 @ X3)) @ (right @ (ext_Product_unit @ X1)))))), inference(fof_simplification,[status(thm)],[fact_3_hmlsl_Olen__non__empty__inside])).
0.70/0.62	thf(c_0_9, negated_conjecture, (~((ord_less_real @ (left @ (ext_Product_unit @ v)) @ (right @ (space @ regular_regular @ ts @ v @ d))))|~((ord_less_real @ (left @ (space @ regular_regular @ ts @ v @ d)) @ (right @ (ext_Product_unit @ v))))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.70/0.62	thf(c_0_10, plain, ![X1:view_e774982825t_unit, X2:traffic, X3:cars]:(((left @ (space @ regular_regular @ X2 @ X1 @ X3))=(pos @ X2 @ X3))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.70/0.62	thf(c_0_11, plain, ![X971:view_e774982825t_unit, X972:traffic, X973:cars]:((((ord_less_real @ (left @ (ext_Product_unit @ X971)) @ (right @ (space @ regular_regular @ X972 @ X971 @ X973)))|~(ord_less_real @ zero_zero_real @ (real_length @ (len @ regular_regular @ X971 @ X972 @ X973))))&((ord_less_real @ (left @ (space @ regular_regular @ X972 @ X971 @ X973)) @ (right @ (ext_Product_unit @ X971)))|~(ord_less_real @ zero_zero_real @ (real_length @ (len @ regular_regular @ X971 @ X972 @ X973)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])).
0.70/0.62	thf(c_0_12, plain, (ord_less_real @ zero_zero_real @ (real_length @ (len @ regular_regular @ v @ ts @ d))), inference(split_conjunct,[status(thm)],[fact_4_v_H__d])).
0.70/0.62	thf(c_0_13, plain, ((len @ regular_regular @ v @ ts @ c)=(len @ regular_regular @ v @ ts @ d)), inference(split_conjunct,[status(thm)],[fact_11_len__eq])).
0.70/0.62	thf(c_0_14, negated_conjecture, (~((ord_less_real @ (left @ (ext_Product_unit @ v)) @ (right @ (space @ regular_regular @ ts @ v @ d))))|~((ord_less_real @ (pos @ ts @ d) @ (right @ (ext_Product_unit @ v))))), inference(rw,[status(thm)],[c_0_9, c_0_10])).
0.70/0.62	thf(c_0_15, plain, ![X1:view_e774982825t_unit, X2:traffic, X3:cars]:(((ord_less_real @ (left @ (ext_Product_unit @ X1)) @ (right @ (space @ regular_regular @ X2 @ X1 @ X3)))|~((ord_less_real @ zero_zero_real @ (real_length @ (len @ regular_regular @ X1 @ X2 @ X3)))))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.70/0.62	thf(c_0_16, plain, (ord_less_real @ zero_zero_real @ (real_length @ (len @ regular_regular @ v @ ts @ c))), inference(rw,[status(thm)],[c_0_12, c_0_13])).
0.70/0.62	thf(c_0_17, plain, ![X1:view_e774982825t_unit, X2:traffic, X3:cars]:(((ord_less_real @ (left @ (space @ regular_regular @ X2 @ X1 @ X3)) @ (right @ (ext_Product_unit @ X1)))|~((ord_less_real @ zero_zero_real @ (real_length @ (len @ regular_regular @ X1 @ X2 @ X3)))))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.70/0.62	thf(c_0_18, negated_conjecture, ~((ord_less_real @ (pos @ ts @ d) @ (right @ (ext_Product_unit @ v)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13]), c_0_16])])).
0.70/0.62	thf(c_0_19, plain, ![X1:view_e774982825t_unit, X2:traffic, X3:cars]:(((ord_less_real @ (pos @ X2 @ X3) @ (right @ (ext_Product_unit @ X1)))|~((ord_less_real @ zero_zero_real @ (real_length @ (len @ regular_regular @ X1 @ X2 @ X3)))))), inference(rw,[status(thm)],[c_0_17, c_0_10])).
0.70/0.62	thf(c_0_20, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_13]), c_0_16])]), ['proof']).
0.70/0.62	# SZS output end CNFRefutation
0.70/0.62	# Parsed axioms                        : 322
0.70/0.62	# Removed by relevancy pruning/SinE    : 65
0.70/0.62	# Initial clauses                      : 471
0.70/0.62	# Removed in clause preprocessing      : 20
0.70/0.62	# Initial clauses in saturation        : 451
0.70/0.62	# Processed clauses                    : 673
0.70/0.62	# ...of these trivial                  : 13
0.70/0.62	# ...subsumed                          : 153
0.70/0.62	# ...remaining for further processing  : 507
0.70/0.62	# Other redundant clauses eliminated   : 41
0.70/0.62	# Clauses deleted for lack of memory   : 0
0.70/0.62	# Backward-subsumed                    : 12
0.70/0.62	# Backward-rewritten                   : 10
0.70/0.62	# Generated clauses                    : 880
0.70/0.62	# ...of the previous two non-redundant : 642
0.70/0.62	# ...aggressively subsumed             : 0
0.70/0.62	# Contextual simplify-reflections      : 0
0.70/0.62	# Paramodulations                      : 837
0.70/0.62	# Factorizations                       : 4
0.70/0.62	# NegExts                              : 0
0.70/0.62	# Equation resolutions                 : 43
0.70/0.62	# Disequality decompositions           : 0
0.70/0.62	# Total rewrite steps                  : 325
0.70/0.62	# ...of those cached                   : 253
0.70/0.62	# Propositional unsat checks           : 0
0.70/0.62	#    Propositional check models        : 0
0.70/0.62	#    Propositional check unsatisfiable : 0
0.70/0.62	#    Propositional clauses             : 0
0.70/0.62	#    Propositional clauses after purity: 0
0.70/0.62	#    Propositional unsat core size     : 0
0.70/0.62	#    Propositional preprocessing time  : 0.000
0.70/0.62	#    Propositional encoding time       : 0.000
0.70/0.62	#    Propositional solver time         : 0.000
0.70/0.62	#    Success case prop preproc time    : 0.000
0.70/0.62	#    Success case prop encoding time   : 0.000
0.70/0.62	#    Success case prop solver time     : 0.000
0.70/0.62	# Current number of processed clauses  : 162
0.70/0.62	#    Positive orientable unit clauses  : 55
0.70/0.62	#    Positive unorientable unit clauses: 2
0.70/0.62	#    Negative unit clauses             : 9
0.70/0.62	#    Non-unit-clauses                  : 96
0.70/0.62	# Current number of unprocessed clauses: 703
0.70/0.62	# ...number of literals in the above   : 1792
0.70/0.62	# Current number of archived formulas  : 0
0.70/0.62	# Current number of archived clauses   : 308
0.70/0.62	# Clause-clause subsumption calls (NU) : 12113
0.70/0.62	# Rec. Clause-clause subsumption calls : 5450
0.70/0.62	# Non-unit clause-clause subsumptions  : 155
0.70/0.62	# Unit Clause-clause subsumption calls : 320
0.70/0.62	# Rewrite failures with RHS unbound    : 0
0.70/0.62	# BW rewrite match attempts            : 69
0.70/0.62	# BW rewrite match successes           : 50
0.70/0.62	# Condensation attempts                : 673
0.70/0.62	# Condensation successes               : 14
0.70/0.62	# Termbank termtop insertions          : 52728
0.70/0.62	# Search garbage collected termcells   : 8584
0.70/0.62	
0.70/0.62	# -------------------------------------------------
0.70/0.62	# User time                : 0.084 s
0.70/0.62	# System time              : 0.011 s
0.70/0.62	# Total time               : 0.095 s
0.70/0.62	# Maximum resident set size: 4080 pages
0.70/0.62	
0.70/0.62	# -------------------------------------------------
0.70/0.62	# User time                : 0.094 s
0.70/0.62	# System time              : 0.015 s
0.70/0.62	# Total time               : 0.109 s
0.70/0.62	# Maximum resident set size: 2212 pages
0.70/0.62	% E exiting
0.70/0.62	% E exiting
0.70/0.62	EOF